翻訳と辞書 |
Double counting (proof technique) : ウィキペディア英語版 | Double counting (proof technique) In combinatorics, double counting, also called counting in two ways, is a combinatorial proof technique for showing that two expressions are equal by demonstrating that they are two ways of counting the size of one set. In this technique, which call “one of the most important tools in combinatorics,” one describes a finite set ''X'' from two perspectives leading to two distinct expressions for the size of the set. Since both expressions equal the size of the same set, they equal each other. ==Examples==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Double counting (proof technique)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|